Order and Arithmetic of Cardinalities
نویسنده
چکیده
Here we pursue Cantor’s theory of cardinalities of infinite sets a bit more deeply. We also begin to take a more sophisticated approach in that we identify which results depend upon the Axiom of Choice and strive to give proofs which avoid it when possible. However, we defer a formal discussion of the Axiom of Choice and its equivalents to a later installment, so the reader who has not encountered it before can ignore these comments and/or skip ahead to the next installment.
منابع مشابه
A Signal Processing Approach to Estimate Underwater Network Cardinalities with Lower Complexity
An inspection of signal processing approach in order to estimate underwater network cardinalities is conducted in this research. A matter of key prominence for underwater network is its cardinality estimation as the number of active cardinalities varies several times due to numerous natural and artificial reasons due to harsh underwater circumstances. So, a proper estimation technique is mandat...
متن کاملThe First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is equal to the number of elements stored in the data structure. Using a program analysis framework that supports abstraction of data structures as sets, such constraints can be expressed using the language of sets with c...
متن کاملRigid models of Presburger arithmetic
We present a description of rigid models of Presburger arithmetic (i.e., Z-groups). In particular, we show that Presburger arithmetic has rigid models of all infinite cardinalities up to the continuum, but no larger.
متن کاملRole Hierarchies and Number Restrictions
We present the atomic decomposition technique as a general method for reducing reasoning about cardinalities of sets, in the DL case the cardinalities of role llers, to equation solving problems. Then we apply the technique to a particular description logic with complex role terms and role hierarchies and a strong arithmetic component.
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کامل